En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:
الصفة
مساعد على الكشف; مشجع الطالب على اِكتشاف
In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.
It is related to the concept of consistent heuristics. While all consistent heuristics are admissible, not all admissible heuristics are consistent.